A Coupling Argument for the Random Transposition Walk
نویسنده
چکیده
This paper explores the mixing time of the random transposition walk on the symmetric group Sn. While it has long been known that this walk mixes in O(n log n) time, this result has not previously been attained using coupling. A coupling argument showing the correct order mixing time is presented. This is accomplished by first projecting to conjugacy classes, and then using the Bubley-Dyer path coupling construction. In order to obtain appropriate bounds on the time it takes the path coupling to meet, ideas from Schramm’s paper “Compositions of Random Transpositions” are used.
منابع مشابه
Cutoff for the Star Transposition Random Walk
In this note, we give a complete proof of the cutoff phenomenon for the star transposition random walk on the symmetric group.
متن کاملNotes for lecture 11, February 19. Strong stationary time for riffle shuffle. Example: Random Walk on a grid Consider a random walk on in for fixed. The distribution will be fairly smooth across a ball of radius
Example: Random Walk on a grid Consider a random walk on in for fixed. The distribution will be fairly smooth across a ball of radius after time . The real distribution will be some multi-dimensional binomial, which has a quadratic Taylor expansion about the starting position; the distributions conditional on various starting points that are within distance of each other, are very similar. We c...
متن کاملModi!ed logarithmic Sobolev inequalities for some models of random walk!
Logarithmic Sobolev inequalities are a well-studied technique for estimating rates of convergence of Markov chains to their stationary distributions. In contrast to continuous state spaces, discrete settings admit several distinct log Sobolev inequalities, one of which is the subject of this paper. Here we derive modi!ed log Sobolev inequalities for some models of random walk, including the ran...
متن کاملScaling of a random walk on a supercritical contact process
A proof is provided of a strong law of large numbers for a one-dimensional random walk in a dynamic random environment given by a supercritical contact process in equilibrium. The proof is based on a coupling argument that traces the space-time cones containing the infection clusters generated by single infections and uses that the random walk eventually gets trapped inside the union of these c...
متن کاملA PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کامل